ATKINSON'S "PERFECT" TRUSS.

Planning the reconfiguration of grounded truss structures with truss climbing robots that carry truss elements Citation

In this paper we describe an optimal reconfiguration planning algorithm that morphs a grounded truss structure of known geometry into a new geometry. The plan consists of a sequence of paths to move truss elements to their new locations that generate the new truss geometry. The trusses are grounded and remain connected at all time. Intuitively, the algorithm grows gradually the new truss struct...

Truss-based Community Search: a Truss-equivalence Based Indexing Approach

We consider the community search problem defined upon a large graph G: given a query vertex q in G, to find as output all the densely connected subgraphs of G, each of which contains the query v. As an online, query-dependent variant of the well-known community detection problem, community search enables personalized community discovery that has found widely varying applications in real-world, ...

Truss Assembly : Motion Control

The nonholonomic motion planning problem is considered for a novel class of modular mobile manipulators, where each module is implemented as a planar parallel manipulator with idler wheels. This assembly is actuated by shape changes of its modules, which, under the in uence of the nonholonomic constraints on the wheels, induce a global snake{like motion of the assembly. The kinematics for a 2{ ...

Attribute Truss Community Search

Recently, community search over graphs has attracted significant attention and many algorithms have been developed for finding dense subgraphs from large graphs that contain given query nodes. In applications such as analysis of protein protein interaction (PPI) networks, citation graphs, and collaboration networks, nodes tend to have attributes. Unfortunately, most previously developed communi...

Truss Design and Convex Optimization